#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e6+100;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n;cin>>n;
  LL num0=0;LL num1=0;
  for(LL i=1;i<=n;i++){
    cin>>a[i];
    if(a[i]&1) num1++;
    else if(a[i]%2==0) num0++;
  }
  if(n&1){
    if(num1==1) cout<<"NiuNiu"<<"\n";
    else cout<<"NiuMei"<<"\n";
  }
  else if(n%2==0){
    if(num1>=n-1){
        cout<<"NiuNiu"<<"\n";
    }
    else cout<<"NiuMei"<<"\n";
  }
return 0;
}
